package _general;

public class Config {
	
	public static final boolean log = false;

	// bring the problem to the console, if this makes sense
	public static final boolean problemToConsole = false;
	
	// show the problem in a window, if this makes sense and set the dimension of the window
	public static final boolean problemToWindow = false;
	public static final int WindowWidth  = 800;
	public static final int WindowHeight = 600;
	
	// if the problem case should be shown
	public static final boolean showResult = false;
	public static final boolean count = true;
		
	//public static final int[] listSize = {2000, 4000, 6000, 8000, 10000, 15000, 20000, 25000, 30000, 35000, 40000, 45000, 50000, 55000, 60000, 65000, 70000, 75000, 80000, 85000, 90000, 95000, 100000};
//	public static final int[] listSize = {2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98};
//	public static final int[] listSize = {20, 40, 60, 80, 100, 120, 140, 160, 180, 200, 220, 240, 260, 280, 300, 320, 340, 360, 380, 400, 420, 440, 460, 480, 500, 520, 540, 560, 580, 600, 620, 640, 660, 680, 700};
	public static final int[] listSize = {100};
	// random, ascending, descending
	public static final String[] preSortTypes = {"random"};
	
	public static final int iterations = 50;
	
	public static final String[] algorithm = {	
//		"insertionsort.Insertionsort",
//		"quicksort.Quicksort",
//		"mergesort.StraightMergesort"
//		"crossCount.GenerallyCrossCount",
//		"crossCount.GenerallyCrossCountLeftTree",
//		"crossCount.BruteForce",
		"shortestpath.bellmanford.BellmanFord"
	};
	
	public static final int[] problemRange = {10, 50};
	
	
	// determine the time analysis
	public static final boolean analysisToConsole = true;
	public static final boolean analysisToFile = true;
	public static final boolean analysisToWindow = false;
}
